On the Semantics of Supernormal Defaults
نویسنده
چکیده
Our aim is to clarify which nonmonotonic consequence relation |∼∆ is given by a set ∆ of “supernormal” defaults, i.e. defaults of the form (true : δ)/δ. There are in fact a number of proposals for |∼∆ (e.g. the skeptical and the credulous semantics). In this paper we look at the space of all possible default semantics and try to characterize the known ones by their properties, especially the valid deduction rules. For instance, it seems reasonable to require that any useful semantics should coincide with the original CWA if this is consistent. We might also want to allow proofs by case analysis. Then we get the skeptical semantics (assuming some other very natural deduction rules). Our results are in fact completeness proofs for “natural deduction systems” based on different default semantics.
منابع مشابه
A Theorem Prover for Prioritized Supernormal Defaults
We present a top-down theorem prover for arbitrary clauses and defaults of the form true : δ/δ (supernormal defaults) with priorities. This especially allows to specify the perfect model semantics for stratified programs, but it includes also disjunctions, classical negation and more general defaults than the usual negations. In this paper, we concentrate on the handling of the priorities and c...
متن کاملDeduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential entailment and show that the semantics given in [Bre91] has to be modified in order to be equivalent to a preferential model approach. Concering the multiple extension problem, we introduce the careful view as an alternati...
متن کاملDP — A System for Reasoning with Supernormal Defaults
DP is a top-down theorem prover for supernormal or Poole-type defaults. Axioms and defaults can be arbitrary clauses, i.e. it supports disjunctions and (real) classical negation. Multiple disjunctions can be handled credulously, skeptically, and carefully. In skeptical mode, the expressivity of supernormal defaults corresponds to variable circumscription. The system is based on model eliminatio...
متن کاملSemantics for multi-agent only knowing: extended abstract
The paper presents a Kripke semantics for a multi-agent generalization of Levesque’s logic of “only knowing”. We prove soundness and completeness and show that the logic has the Finite model property. The logic satisfies a Modal reduction theorem to the effect that any complex syntactical representation can be syntactically reduced to a provably equivalent form which directly reflects all the m...
متن کاملModular Speciications with Supernormal Defaults ?
We add a simple module system to speciications with super-normal defaults. It allows to distinguish between \deening" and \calling" occurrences of predicates. This greatly improves the understandability of large default speciications and especially helps to solve the problem of unwanted contrapositions of rules. Our approach is similar to the distinction between head and body of logic programmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993